Reasoning about integrity constraints for tree-structured data

Reasoning about Message Integrity

We propose an approach for reasoning about message integrity protection in cryptographic protocols. The set of axioms presented herein relate design parameters and assumptions of message integrity protection mechanisms to generic message integrity threats. Comparison of threat properties derived using these axioms with the policy goals for integrity protection aids in assessing the strength (or...

Reasoning about Connectivity Constraints

Many problems in computational sustainability involve constraints on connectivity. When designing a new wildlife corridor, we need it to be geographically connected. When planning the harvest of a forest, we need new areas to harvest to be connected to areas that have already been harvested so we can access them easily. And when town planning, we need to connect new homes to the existing utilit...

Privacy Architectures: Reasoning about Data Minimisation and Integrity

Privacy by design will become a legal obligation in the European Community if the Data Protection Regulation eventually gets adopted. However, taking into account privacy requirements in the design of a system is a challenging task. We propose an approach based on the specification of privacy architectures and focus on a key aspect of privacy, data minimisation, and its tension with integrity r...

Integrity Constraints for Linked Data

Linked Data makes one central addition to the Semantic Web principles: all entity URIs should be dereferenceable to provide an authoritative RDF representation. URIs in a linked dataset can be partitioned into the exported URIs for which the dataset is authoritative versus the imported URIs the dataset is linking against. This partitioning has an impact on integrity constraints, as a Closed Wor...

Reasoning about participation constraints and Chen's constraints